Bijections between Directed Animals, Multisets and Grand-Dyck Paths

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Bijections between 231-avoiding Permutations and Dyck Paths

We construct a bijection between 231-avoiding permutations and Dyck paths that sends the sum of the major index and the inverse major index of a 231avoiding permutation to the major index of the corresponding Dyck path. Furthermore, we relate this bijection to others and exhibit a bistatistic on 231-avoiding permutations which is related to the q, t-Catalan numbers.

متن کامل

Bijections from Weighted Dyck Paths to Schröder Paths

Kim and Drake used generating functions to prove that the number of 2-distant noncrossing matchings, which are in bijection with little Schröder paths, is the same as the weight of Dyck paths in which downsteps from even height have weight 2. This work presents bijections from those Dyck paths to little Schröder paths, and from a similar set of Dyck paths to big Schröder paths. We show the effe...

متن کامل

Dyck paths and a bijection for multisets of hook numbers

We give a bijective proof of a conjecture of Regev and Vershik [7] on the equality of two multisets of hook numbers of certain skew-Young diagrams. The bijection proves a result that is stronger and more symmetric than the original conjecture, by means of a construction involving Dyck paths, a particular type of lattice path.

متن کامل

An algorithm to describe bijections involving Dyck paths

We use an algorithm to define bijections involving Dyck paths. This algorithm is parametrized by rewriting rules and is similar to the derivation of a word in a context-free grammar. The bijections are variations of a classical one which is based on the insertion of a peak in the last descent. A systematic study of the algorithms parametrized by a single rewriting rule leads to 6 bijections, ta...

متن کامل

Bijections from Dyck paths to 321-avoiding permutations revisited

There are at least three di erent bijections in the literature from Dyck paths to 321-avoiding permutations, due to Billey-Jockusch-Stanley, Krattenthaler, and Mansour-Deng-Du. How di erent are they? Denoting them B;K;M respectively, we show that M = B Æ L = K Æ L where L is the classical Kreweras-Lalanne involution on Dyck paths and L0, also an involution, is a sort of derivative of L. Thus K ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Electronic Journal of Combinatorics

سال: 2020

ISSN: 1077-8926

DOI: 10.37236/8826